Dynamic Placement Using Ants for Object Based Simulations
Identifieur interne : 001508 ( Main/Exploration ); précédent : 001507; suivant : 001509Dynamic Placement Using Ants for Object Based Simulations
Auteurs : Cyrille Bertelle [France] ; Antoine Dutot [France] ; Frédéric Guinand [France] ; Damien Olivier [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2003.
Abstract
Abstract: A distributed application may be considered as a set of interacting entities continuously evolving. Such application can be modeled as a graph with one-to-one mappings between vertices and entities and between edges and communications. Performances depend directly on a good load balancing of the entities between available computing devices and on the minimization of the impact of the communications between them. However, both objectives are contradictory and good performances are achieved if and only if a good tradeoff is found. Our method for finding such a tradeoff is new and based on colored ant colonies. Each computing resource is associated to one ant colony characterized by a color, allowing an implicit consideration of the load balancing constraint. Then, using colored pheromones, ants are just seeking for communicating structures. The method operates on graphs which structural and numerical parameters may change dynamically during the execution.
Url:
DOI: 10.1007/978-3-540-39964-3_80
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000534
- to stream Istex, to step Curation: 000534
- to stream Istex, to step Checkpoint: 000693
- to stream Main, to step Merge: 001544
- to stream Main, to step Curation: 001508
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Dynamic Placement Using Ants for Object Based Simulations</title>
<author><name sortKey="Bertelle, Cyrille" sort="Bertelle, Cyrille" uniqKey="Bertelle C" first="Cyrille" last="Bertelle">Cyrille Bertelle</name>
</author>
<author><name sortKey="Dutot, Antoine" sort="Dutot, Antoine" uniqKey="Dutot A" first="Antoine" last="Dutot">Antoine Dutot</name>
</author>
<author><name sortKey="Guinand, Frederic" sort="Guinand, Frederic" uniqKey="Guinand F" first="Frédéric" last="Guinand">Frédéric Guinand</name>
</author>
<author><name sortKey="Olivier, Damien" sort="Olivier, Damien" uniqKey="Olivier D" first="Damien" last="Olivier">Damien Olivier</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:86F02A6F73616FBB8601044F1E6EEE3AE30DFF86</idno>
<date when="2003" year="2003">2003</date>
<idno type="doi">10.1007/978-3-540-39964-3_80</idno>
<idno type="url">https://api.istex.fr/document/86F02A6F73616FBB8601044F1E6EEE3AE30DFF86/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000534</idno>
<idno type="wicri:Area/Istex/Curation">000534</idno>
<idno type="wicri:Area/Istex/Checkpoint">000693</idno>
<idno type="wicri:doubleKey">0302-9743:2003:Bertelle C:dynamic:placement:using</idno>
<idno type="wicri:Area/Main/Merge">001544</idno>
<idno type="wicri:Area/Main/Curation">001508</idno>
<idno type="wicri:Area/Main/Exploration">001508</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Dynamic Placement Using Ants for Object Based Simulations</title>
<author><name sortKey="Bertelle, Cyrille" sort="Bertelle, Cyrille" uniqKey="Bertelle C" first="Cyrille" last="Bertelle">Cyrille Bertelle</name>
<affiliation wicri:level="3"><country>France</country>
<placeName><settlement type="city">Le Havre</settlement>
<region type="région" nuts="2">Région Normandie</region>
<region type="old region" nuts="2">Haute-Normandie</region>
</placeName>
<wicri:orgArea>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600</wicri:orgArea>
</affiliation>
</author>
<author><name sortKey="Dutot, Antoine" sort="Dutot, Antoine" uniqKey="Dutot A" first="Antoine" last="Dutot">Antoine Dutot</name>
<affiliation wicri:level="3"><country>France</country>
<placeName><settlement type="city">Le Havre</settlement>
<region type="région" nuts="2">Région Normandie</region>
<region type="old region" nuts="2">Haute-Normandie</region>
</placeName>
<wicri:orgArea>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600</wicri:orgArea>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Guinand, Frederic" sort="Guinand, Frederic" uniqKey="Guinand F" first="Frédéric" last="Guinand">Frédéric Guinand</name>
<affiliation wicri:level="3"><country>France</country>
<placeName><settlement type="city">Le Havre</settlement>
<region type="région" nuts="2">Région Normandie</region>
<region type="old region" nuts="2">Haute-Normandie</region>
</placeName>
<wicri:orgArea>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600</wicri:orgArea>
</affiliation>
</author>
<author><name sortKey="Olivier, Damien" sort="Olivier, Damien" uniqKey="Olivier D" first="Damien" last="Olivier">Damien Olivier</name>
<affiliation wicri:level="3"><country>France</country>
<placeName><settlement type="city">Le Havre</settlement>
<region type="région" nuts="2">Région Normandie</region>
<region type="old region" nuts="2">Haute-Normandie</region>
</placeName>
<wicri:orgArea>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600</wicri:orgArea>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2003</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">86F02A6F73616FBB8601044F1E6EEE3AE30DFF86</idno>
<idno type="DOI">10.1007/978-3-540-39964-3_80</idno>
<idno type="ChapterID">80</idno>
<idno type="ChapterID">Chap80</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: A distributed application may be considered as a set of interacting entities continuously evolving. Such application can be modeled as a graph with one-to-one mappings between vertices and entities and between edges and communications. Performances depend directly on a good load balancing of the entities between available computing devices and on the minimization of the impact of the communications between them. However, both objectives are contradictory and good performances are achieved if and only if a good tradeoff is found. Our method for finding such a tradeoff is new and based on colored ant colonies. Each computing resource is associated to one ant colony characterized by a color, allowing an implicit consideration of the load balancing constraint. Then, using colored pheromones, ants are just seeking for communicating structures. The method operates on graphs which structural and numerical parameters may change dynamically during the execution.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Haute-Normandie</li>
<li>Région Normandie</li>
</region>
<settlement><li>Le Havre</li>
</settlement>
</list>
<tree><country name="France"><region name="Région Normandie"><name sortKey="Bertelle, Cyrille" sort="Bertelle, Cyrille" uniqKey="Bertelle C" first="Cyrille" last="Bertelle">Cyrille Bertelle</name>
</region>
<name sortKey="Dutot, Antoine" sort="Dutot, Antoine" uniqKey="Dutot A" first="Antoine" last="Dutot">Antoine Dutot</name>
<name sortKey="Dutot, Antoine" sort="Dutot, Antoine" uniqKey="Dutot A" first="Antoine" last="Dutot">Antoine Dutot</name>
<name sortKey="Guinand, Frederic" sort="Guinand, Frederic" uniqKey="Guinand F" first="Frédéric" last="Guinand">Frédéric Guinand</name>
<name sortKey="Olivier, Damien" sort="Olivier, Damien" uniqKey="Olivier D" first="Damien" last="Olivier">Damien Olivier</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001508 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001508 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/France |area= LeHavreV1 |flux= Main |étape= Exploration |type= RBID |clé= ISTEX:86F02A6F73616FBB8601044F1E6EEE3AE30DFF86 |texte= Dynamic Placement Using Ants for Object Based Simulations }}
This area was generated with Dilib version V0.6.25. |